CSE 190, Great ideas in algorithms: Expander graphs
ثبت نشده
چکیده
Our interest however will be in constructing large but very sparse graphs (ideally with d = 3) for which h(G) ≥ c for some absolute constant c > 0. Such graphs are “highly connected” graphs. For example, the following lemma shows that by deleting a few edges in such graphs, we can only disconnect a few vertices. This is very useful for example in network design, where we want the failure of edges to effect as few nodes as possible.
منابع مشابه
Random and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we will study random walks on general graphs, leading to a the randomized logspace algorit...
متن کاملBeyond Apollonian Circle Packings: Expander Graphs, Number Theory and Geometry
In the last decade tremendous effort has been put in the study of the Apollonian circle packings. Given the great variety of mathematics it exhibits, this topic has attracted experts from different fields: number theory, homogeneous dynamics, expander graphs, group theory, to name a few. The principle investigator (PI) contributed to this program in his PhD studies. The scenery along the way fo...
متن کاملExpander Graphs and Property (t)
Families of expander graphs are sparse graphs such that the number of vertices in each graph grows yet each graph remains difficult to disconnect. Expander graphs are of great importance in theoretical computer science. In this paper we study the connection between the Cheeger constant, a measure of the connectivity of the graph, and the smallest nonzero eigenvalue of the graph Laplacian. We sh...
متن کاملParallel algorithms based on expander graphs for optical computing.
We consider the task of interconnecting processors to realize efficient parallel algorithms. We propose interconnecting processors using certain graphs called expander graphs, which can provide fast communication from any group of processors to the rest of the network. We show that these interconnections would result in a number of efficient parallel algorithms for sorting, routing, associative...
متن کامل